Maximal Cohen–Macaulay Approximations and Serre’s Condition
نویسندگان
چکیده
منابع مشابه
Effective Computation of Maximal Sound Approximations of Description Logic Ontologies
We study the problem of approximating Description Logic (DL) ontologies specified in a source language LS in terms of a less expressive target language LT . This problem is getting very relevant in practice: e.g., approximation is often needed in ontology-based data access systems, which are able to deal with ontology languages of a limited expressiveness. We first provide a general, parametric...
متن کاملMAXIMAL PRYM VARIETY AND MAXIMAL MORPHISM
We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.
متن کاملOn a condition equivalent to the Maximal Distance Separable conjecture
We prove that the following are equivalent. We denote by Pq the vector space of functions from a finite field Fq to itself, which can be represented as the space Pq := Fq[x]/(x q − x) of polynomial functions. We denote by On ⊂ Pq the set of polynomials that are either the zero polynomial, or have at most n distinct roots in Fq. Given two subspaces Y,Z of Pq, we denote by 〈Y,Z〉 their span. • Let...
متن کاملFinding Characters Satisfying a Maximal Condition for Their Unipotent Support
In this article we extend independent results of Lusztig and Hézard concerning the existence of irreducible characters of finite reductive groups, (defined in good characteristic and arising from simple algebraic groups), satisfying a strong numerical relationship with their unipotent support. Along the way we obtain some results concerning quasi-isolated semisimple elements.
متن کاملSolutions of Maximal Compatible Granules and Approximations in Rough Set Models
This paper emphasizes studying on a new method to rough set theory by obtaining granules with maximal compatible classes as primitive ones in which any two objects are mutually compatible, proposes the upper and lower approximation computations to extend rough set models for further building multi-granulation rough set theory in incomplete information systems, discusses the properties and relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Vietnamica
سال: 2015
ISSN: 0251-4184,2315-4144
DOI: 10.1007/s40306-014-0105-9